منابع مشابه
On Complete Reasoning about Axiomatic Specifications
Automated software verification tools typically accept specifications of functions in terms of preand postconditions. However, many properties of functional programs can be more naturally specified using a more general form of universally quantified properties. Such general specifications may relate multiple user-defined functions, and compare multiple invocations of a function on different arg...
متن کاملAxiomatic characterization of nonlinear homomorphic means
One important problem in mathematics and statistics is to formulate a mean from a set of data. Various definitions of mean have been studied to represent in some sense an average of data. The applications of these means involve all the fields of science and technology, with nonlinear filtering being a primary example in the area of image processing [1–3]. The goal of this work is to axiomatical...
متن کاملAn Axiomatic Basis for Reasoning about Trust in PKIs
Trust is essential to a communication channel. The trust relationships, which play an important role in Public Key Infrastructures (PKIs), need to be formalized for providing a reliable modelling methodology to support secure digital communications. In this paper, we present a typed modal logic used for specifying and reasoning about trust in PKIs. In order to study trust relationships within P...
متن کاملAn Axiomatic Approach to Defining Approximation Measures for Functional Dependencies
We consider the problem of defining an approximation measure for functional dependencies (FDs). An approximation measure for X → Y is a function mapping relation instances, r, to non-negative real numbers. The number to which r is mapped, intuitively, describes the “degree” to which the dependency X → Y holds in r. We develop a set of axioms for measures based on the following intuition. The de...
متن کاملTowards Complete Reasoning about Axiomatic Specifications
To support verification of expressive properties of functional programs, we consider algebraic style specifications that may relate multiple user-defined functions, and compare multiple invocations of a function for different arguments. We present decision procedures for reasoning about such universally quantified properties of functional programs, using local theory extension methodology. We e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis in Theory and Applications
سال: 2018
ISSN: 1672-4070,1573-8175
DOI: 10.4208/ata.2018.v34.n1.3